Delta-Convexity With Given Weights
نویسندگان
چکیده
منابع مشابه
A program generating homogeneous random graphs with given weights
We present a program package to generate homogeneous random graphs with probabilities prescribed by the user. The statistical weight of a labeled graph α is given in the form W(α)=∏Ni=1 p(qi), where p(q) is an arbitrary user function and qi are the degrees of the graph nodes. The program can be used to generate two types of graphs (simple graphs and pseudo-graphs) from three types of ensembles ...
متن کاملA convexity property of expectations under exponential weights
Take a random variable X with distribution μ with some finite exponential moments, and weight it by an exponential factor e to get the distribution μ for the admissible θ-values. Define also the so-weighted expectation ̺(θ) := EX with inverse function θ(̺). This note proves that for a convex function Φ, EΦ(X) is a convex function of ̺, wherever it exists and is finite. Along the way we develop cor...
متن کاملA Note on Convexity, Concavity, and Growth Conditions in Discrete Fractional Calculus with Delta Difference
We demonstrate that some recent results regarding the connection between the convexity of the map t → f (t) and the sign of Δa f (t) , with 2 < ν < 3 , can be improved. In particular, by utilizing a recent inequality due to Jia, Erbe, and Peterson, we are able to improve some of the existing results in the literature. As part of this study we illustrate the improvements that our results afford ...
متن کاملEQ-logics with delta connective
In this paper we continue development of formal theory of a special class offuzzy logics, called EQ-logics. Unlike fuzzy logics being extensions of theMTL-logic in which the basic connective is implication, the basic connective inEQ-logics is equivalence. Therefore, a new algebra of truth values calledEQ-algebra was developed. This is a lower semilattice with top element endowed with two binary...
متن کاملUniqueness of the weights for minimal feedforward nets with a given input-output map
|{ We show that, for feedforward nets with a single hidden layer, a single output node, and a \transfer function" Tanhs, the net is uniquely determined by its input-output map, up to an obvious nite group of symmetries (permutations of the hidden nodes, and changing the sign of all the weights associated to a particular hidden node), provided that the net is irreducible, i.e. that there does no...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales Mathematicae Silesianae
سال: 2020
ISSN: 2391-4238,0860-2107
DOI: 10.2478/amsil-2020-0003